Leonard pairs, spin models, and distance-regular graphs
نویسندگان
چکیده
A Leonard pair is an ordered of diagonalizable linear maps on a finite-dimensional vector space, that each act eigenbasis for the other one in irreducible tridiagonal fashion. In present paper we consider type pair, said to have spin. The notion spin model was introduced by V.F.R. Jones construct link invariants. symmetric matrix over C satisfies two conditions, called II and III conditions. It known W contained certain algebra N(W), Nomura algebra. often happens W∈M⊆N(W), where M Bose-Mesner distance-regular graph Γ; this case say Γ affords W. If model, then module every Terwilliger takes form, recently described Caughman, Curtin, Nomura, Wolff. show converse true; if model. We explicitly when has q-Racah type. proof our main result relies heavily theory pairs.
منابع مشابه
Some Formulas for Spin Models on Distance-Regular Graphs
A spin model is a square matrix W satisfying certain conditions which ensure that it yields an invariant of knots and links via a statistical mechanical construction of V. F. R. Jones. Recently F. Jaeger gave a topological construction for each spin model W of an association scheme which contains W in its Bose Mesner algebra. Shortly thereafter, K. Nomura gave a simple algebraic construction of...
متن کاملEdge-distance-regular graphs are distance-regular
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...
متن کاملShilla distance-regular graphs
A Shilla distance-regular graph Γ (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divides k for a Shilla distance-regular graph Γ, and for Γ we define b = b(Γ) := k a3 . In this paper we will show that there are finitely many Shilla distance-regular graphs Γ with fixed b(Γ) ≥ 2. Also, we will classify Sh...
متن کاملDistance mean-regular graphs
We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. A graph Γ = (V,E) with diameter D is distance meanregular when, for given u ∈ V , the averages of the intersection numbers ai(u, v), bi(u, v), and ci(u, v) (defined as usual), computed over all vertices v at distance i = 0, 1, . . . , D from u, do...
متن کاملTight Distance-Regular Graphs
We consider a distance regular graph with diameter d and eigenvalues k d We show the intersection numbers a b satisfy k a d k a ka b a We say is tight whenever is not bipartite and equality holds above We charac terize the tight property in a number of ways For example we show is tight if and only if the intersection numbers are given by certain rational expressions involving d independent para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2020.105312